Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
981	A Distributed Algorithm for Large-Scale Generalized Matching Faraz Makari Manshadi Max-Planck-Institut fur ¨ Informatik Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-08-01 05:49:52 Operations research Combinatorial optimization Computational complexity theory Convex optimization Linear programming Randomized rounding Algorithm Mathematical optimization Time complexity Mathematics Theoretical computer science Applied mathematics
982	Solutions to Homework Four CSE[removed]Algorithm A has running time TA (n) = 5TA (n/2) + O(n), Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-31 00:07:52 Sorting algorithms Euclidean algorithm Analysis of algorithms Computational complexity theory Quicksort Time complexity Binary search algorithm Binary logarithm Greatest common divisor Mathematics Theoretical computer science Applied mathematics
983	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2014-10-03 15:18:39 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics
984	CS 61B Reader #2 Data Structures (Into Java) (Fifth Edition) Paul N. Hilfinger University of California, Berkeley Add to Reading List Source URL: inst.eecs.berkeley.edu Language: English - Date: 2008-01-28 16:05:21 Analysis of algorithms Computational complexity theory Big O notation Time complexity Radix sort Algorithm Quicksort Divide and conquer algorithm Asymptotically optimal algorithm Theoretical computer science Mathematics Applied mathematics
985	PS YC HOLOGICA L SC IENCE Research Article How Many Variables Can Humans Process? Add to Reading List Source URL: www.psychologicalscience.org Language: English - Date: 2005-04-05 11:19:44 Constraint programming Cognitive science Creativity Dyslexia Problem solving Working memory Complexity Psychology Computational complexity theory Science Ethology Behavior
986	COCOON 2012 The 18th Annual International Computing and Combinatorics Conference[removed]August 2012, Sydney, Australia. Original research papers in the areas of algorithms, theory of computation, computational complexity, Add to Reading List Source URL: cocoon.it.usyd.edu.au Language: English - Date: 2011-10-31 20:39:26 Applied mathematics Computational complexity theory Algorithm Combinatorics Formal methods Algorithmic Number Theory Symposium Indocrypt Lecture Notes in Computer Science Mathematics Computer science
987	On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:22 Complexity classes NP-complete NP-hard P versus NP problem Co-NP NP Cook–Levin theorem Oracle machine Reduction Theoretical computer science Computational complexity theory Applied mathematics
988	Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran [removed] Erik D. Demaine Add to Reading List Source URL: www.mit.edu Language: English - Date: 2004-06-07 21:08:09 Curves Computational complexity theory Analysis of algorithms Time complexity Ellipse Ε-net Theoretical computer science Applied mathematics Conic sections
989	Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical and Computer Engineering Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2014-02-07 08:36:04 Mathematical optimization Complexity classes Operations research Network theory Shortest path problem Robot Optimization problem Job shop scheduling NP Theoretical computer science Computational complexity theory Applied mathematics
990	How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2014-12-04 03:20:52 Political philosophy Social choice theory Electoral systems Voting systems Psephology Borda count Approval voting NP-complete NP-hard Single winner electoral systems Voting Complexity classes

UPDATE